On Observational Equivalence and Algebraic Specification
نویسندگان
چکیده
The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specification-building operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised to make sense under an arbitrary institution. Behavioural equivalence is treated as an important special case of observational equivalence, and its central role in program development is shown by means of an example. ( 1987 Academic Press. Inc
منابع مشابه
Specification Refinement with System F - The Higher-Order Case
A type-theoretic counterpart to the notion of algebraic specification refinement is discussed for abstract data types with higher-order signatures. The type-theoretic setting consists of System F and the logic for parametric polymorphism of Plotkin and Abadi. For first-order signatures, this setting immediately gives a natural notion of specification refinement up to observational equivalence v...
متن کاملCharacterizing Behavioural Semantics and Abstractor Semantics
In the literature one can distinguish two main approaches to the definition of observational semantics of algebraic specifications. On one hand, observational semantics is defined using a notion of observational satisfaction for the axioms of a specification and on the other hand one can define observational semantics of a specification by abstraction with respect to an observational equivalenc...
متن کاملModel Reduction of Modules for State-Even Temporal Logics
In many Discrete-Event Systems (DES) both state and event information are of importance to the systems designer. Logics such as Ostroff’s RTTL allow for the specification and verification of a system’s state-event behavior. To make realistic problems amenable to analysis, a designer must typically decompose the system into subsystems (modules) and use algebraic abstraction (quotient systems) to...
متن کاملA Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملProving Semantical Equivalence of Data Specifications
More than two decades ago, Peter Freyd introduced essentially algebraic specifications, a well-behaved generalization of algebraic specifications, allowing for equational partiality. These essentially algebraic specifications turn out to have a number of very interesting applications in computer science. In this paper, we present a deduction system for essentially algebraic specifications that ...
متن کامل